On large deviations in load sharing networks

On Large Deviations in Load Sharing Networks

Three policies, namely optimal repacking, least load routing, and Bernoulli splitting, are considered for dynamic resource allocation in load sharing networks with standard Erlang type statistics. Large deviations principles are established for the three policies in a simple network of three consumer types and two resource locations and are used to identify the network overflow exponents. The o...

On Large Deviations in Load Sharing Networks1

Three policies, namely Optimal Repacking, Least Load Routing, and Bernoulli Splitting, are considered for dynamic resource allocation in load sharing networks with standard Erlang type statistics. Large deviations principles are established for the three policies in a simple network of three consumer types and two resource locations, and are used to identify the network overrow exponents. The o...

Large deviations in queueing networks

In this paper we describe how the joint large deviation properties of traac streams are altered when the traac passes through a shared buuer according to a FCFS service policy with stochastic service capacity. We also consider the stationary case, proving large deviation principles for the state of the system in equilibrium and for departures from an equilibrium system.

Large deviations of sojourn times in processor sharing queues

This paper presents a large deviation analysis of the steady-state sojourn time distribution in the GI/G/1 PS queue. Logarithmic estimates are obtained under the assumption of the service time distribution having a light tail, thus supplementing recent results for the heavy-tailed setting. Our proof gives insight in the way a large sojourn time occurs, enabling the construction of an (asymptoti...

Large Deviations and Queueing Networks : Methods for